منابع مشابه
An Ordinal Minimax Theorem
One of the earliest solution concepts considered in game theory are saddle points, combinations of actions such that no player can gain by deviating (see, e.g., von Neumann and Morgenstern, 1947). In two-player zero-sum games, every saddle point happens to coincide with the optimal outcome both players can guarantee in the worst case and thus enjoys a very strong normative foundation. Unfortuna...
متن کاملA Topological Minimax Theorem
We present a topological minimax theorem (Theorem 2.2). The topological assumptions on the spaces involved are somewhat weaker than those usually found in the literature. Even when reinterpreted in the convex setting of topological vector spaces, our theorem yields nonnegligible improvements, for example, of the Passy–Prisman theorem and consequently of the Sion theorem, contrary to most result...
متن کاملProof of the Minimax Theorem
We first characterize a two-person, zero-sum game. 1. There are two players, P1 and P2. 2. P1 has a set A = {a1, a2, . . . , am} of m pure strategies (actions). 3. P2 has a set B = {b1, b2, . . . , bn} of n pure strategies (actions). 4. Each player has a utility for each (ai, bj) pair of actions. The utility for P1 is denoted U1(ai, bj) and the utility for P2 is denoted U2(ai, bj). Since this i...
متن کاملOn the Restricted Ordinal Theorem
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملProof of the Minimax Theorem
Formalization of a 2 Person Zero-Sum Game 1. There are two players, P1 and P2. 2. P1 has a set A = {a1, a2, . . . , am} of m pure strategies (or actions). 3. P2 has a set B = {b1, b2, . . . , bn} of n pure strategies (or actions). 4. Each player has a utility for each (ai, bj) pair of actions. The utility for P1 is denoted U1(ai, bj) and the utility for P2 is denoted U2(ai, bj). Since this is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2016
ISSN: 0899-8256
DOI: 10.1016/j.geb.2015.12.010